Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited

Consider a simple graph and its proper edge coloring c with the elements of the set . We say that c is neighbor set distinguishing (or adjacent strong) if for every edge , the set of colors incident with u is distinct from the set of colors incident with v. Let us then consider a stronger requirement and suppose we wish to distinguishing adjacent vertices by sums of their incident colors. In both problems the challenging conjectures presume that such colorings exist for any graph G containing no isolated edges if only . We prove that in both problems is sufficient. The proof is based on the Combinatorial Nullstellensatz, applied in the “sum environment.” In fact the identical bound also holds if we use any set of k real numbers instead of as edge colors, and the same is true in list versions of the both concepts. In particular, we therefore obtain that lists of length ( in fact) are sufficient for planar graphs.     

Global exponential stability of a delay reduced SIR model for migrant workers’ home residence

The paper is concerned with a reduced SIR model for migrant workers. By using differential inequality technique and a novel argument, we derive a set of conditions to ensure that the endemic equilibrium of the model is globally exponentially stable. The obtained results complement with some existing ones. We also use numerical simulations to demonstrate the theoretical results.     

一个奇摄动微分方程非线性混合边值问题

研究了一个三阶半线性微分方程的奇摄动非线性混合边值问题.利用边界层函数法构造了该问题的形式渐近解,并采用微分不等式理论证明了解的存在性,给出了渐近解的误差估计,最后得出了边界层函数指数型衰减的结论.     

Areas,anti-derivatives,and adding up pieces: Definite integrals in pure mathematics and applied science contexts

Research in mathematics and science education reveals a disconnect for students as they attempt to apply their mathematical knowledge to science and engineering. With this conclusion in mind, this paper investigates a particular calculus topic that is used frequently in science and engineering: the definite integral. The results of this study demonstrate that certain conceptualizations of the definite integral, including the area under a curve and the values of an anti-derivative, are limited in their ability to help students make sense of contextualized integrals. In contrast, the Riemann sum-based “adding up pieces” conception of the definite integral (renamed in this paper as the “multiplicatively-based summation” conception) is helpful and useful in making sense of a variety of applied integral expressions and equations. Implications for curriculum and instruction are discussed.     

On the Dedekind Sums and Two-Term Exponential Sums

In this paper, the authors use the analytic methods and the properties of character sums mod p to study the computational problem of one kind of mean value involving the classical Dedekind sums and two-term exponential sums, and give an exact computational formula for it.     

Asymptotically optimal neighbour sum distinguishing colourings of graphs

Consider a simple graph G = (V,E) and its proper edge colouring c with the elements of the set {1,2,…,k}. The colouring c is said to be neighbour sum distinguishing if for every pair of vertices u, v adjacent in G, the sum of colours of the edges incident with u is distinct from the corresponding sum for v. The smallest integer k for which such colouring exists is known as the neighbour sum distinguishing index of a graph and denoted by . The definition of this parameter, which makes sense for graphs containing no isolated edges, immediately implies that , where Δ is the maximum degree of G. On the other hand, it was conjectured by Flandrin et al. that for all those graphs, except for C₅. We prove this bound to be asymptotically correct by showing that . The main idea of our argument relays on a random assignment of the colours, where the choice for every edge is biased by so called attractors, randomly assigned to the vertices. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 47, 776–791, 2015     

D-admissible hybrid control of a class of singular systems

This paper mainly studies the problem of designing a hybrid state feedback D-admissible controller for a class of linear and nonlinear singular systems. Based on the relationship between singular discrete systems and singular delta operator systems, several necessary and sufficient conditions for a linear singular delta operator system to be D-admissible (i.e. regular, causal and all finite poles lie in a prescribed circular region) with different representations are derived. Then, the existence conditions and explicit expressions of a desirable D-admissible controller are given by means of matrix inequalities and strict linear matrix inequalities, respectively. We further extend the obtained results to singular delta operator systems with Lipschitz nonlinear perturbations, and the design methods of hybrid controller are presented for the nonlinear case as well. Finally, numerical examples as well as simulations are provided to illustrate the effectiveness of the theoretical outcomes obtained in the paper.     

关于广义三项指数和的四次幂均值

The main purpose of this paper is using estimates for trigonometric sums and properties of congruence to study the computation of one kind of fourth power mean of a generalized three-term exponential sum, and give an interesting identity for it.     

一个新的指数削减椭圆形分布族

A new family of univariate exponential slash distribution is introduced, which is based on elliptical distributions and defined by means of a stochastic representation as the scale mixture of an elliptically distributed random variable with respect to the power of an exponential random variable. The same idea is extended to the multivariate case. General properties of the resulting families, including their moments and kurtosis coefficient, are studied. And inferences based on methods of moment and maximum likelihood are discussed. A real data is presented to show this family is flexible and fits much better than other related families.     

非齐次动力方程Duhamel项的精细积分

提出了不需要矩阵求逆运算的求解Duhamel积分项的精细积分方法.通过将精细积分法的关键思想--加法定理和增量存储--直接应用于Duhamel积分响应矩阵的求解,可给出当非齐次项分别为多项式、正弦/余弦以及指数函数等基本形式时Duhamel积分在计算机上的精确解.特别的,该算法不依赖于系统矩阵(或相关矩阵)的形态.当系统矩阵奇异或接近奇异时,其优越性更为显著.算例验证了该算法的有效性.